Representations of Integers as the Sum of k Terms
نویسندگان
چکیده
Let A = {a1, a2, . . . } (a1 < a2 < . . . ) be a xed in nite sequence of positive integers, and let Rk(n) denote the number of solutions of ai1 + ai2 + · · · + aik = n, ai1 ∈ A, . . . , aik ∈ A. For k = 2, P. Erd®s and A. Sárközy proved if F (n) is a nice arithmetic function then there exists a sequence A such that |R2(n)−F (n)| (F (n) log n)1/2. The aim of this paper is to extend their result to k > 2 by using probabilistic methods. 2000 AMS Mathematics subject classi cation number : 11B34
منابع مشابه
EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملUpper bounds on the solutions to n = p+m^2
ardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{R}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...
متن کاملThe power digraphs of safe primes
A power digraph, denoted by $G(n,k)$, is a directed graph with $Z_{n}={0,1,..., n-1}$ as the set of vertices and $L={(x,y):x^{k}equiv y~(bmod , n)}$ as the edge set, where $n$ and $k$ are any positive integers. In this paper, the structure of $G(2q+1,k)$, where $q$ is a Sophie Germain prime is investigated. The primality tests for the integers of the form $n=2q+1$ are established in terms of th...
متن کامل$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کاملThe Sum Graph of Non-essential Submodules
Throughout this paper, R will denote a commutative ring with identity and M is a unitary R- module and Z will denote the ring of integers. We introduce the graph Ω(M) of module M with the set of vertices contain all nontrivial non-essential submodules of M. We investigate the interplay between graph-theoretic properties of Ω(M) and algebraic properties of M. Also, we assign the values of natura...
متن کاملOn the ubiquity of Sidon sets
A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B2[g]-set is a set A of integers such that no integer has more than g essentially distinct representations as the sum of two elements of A. It is proved that almost all small sumsets of {1, 2, . . . , n} are B2[g]-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 1 شماره
صفحات -
تاریخ انتشار 1990